Generating functions for purely crossing partitions
نویسنده
چکیده
The generating function for the number of purely crossing partitions of {1, . . . , n} is found in terms of the generating function for Bell numbers. Further results about generating functions for asymptotic moments of certain random Vandermonde matrices are derived.
منابع مشابه
Convexity, Non–Crossing Tree Partitions and Independent Sets in Phylogenetic Trees
Non –crossing set partitions are counted by the Catalan numbers and have been extensively studied in mathematics. We introduce the concept of a non-crossing tree partition and then use generating functions to count the number non-crossing tree partitions in Ordered and Binary Phylogenetic trees. In addition, we explore the connection between convexity, tree partitions and independent sets. Last...
متن کاملNon-Crossing Partitions in Binary, Ordered and Motzkin Trees
Non-Crossing Tree partitions are newer mathematical objects that have recent applications in genetics and mathematical biology. We explore several interesting connections between these partitions and the more commonly studied non-crossing set partitions. While non-crossing set partitions are counted by the Catalan numbers, we prove that non-crossing tree partitions in Binary trees are counted b...
متن کاملNon-crossing partitions for classical reflection groups
We introduce analogues of the lattice of non-crossing set partitions for the classical reeection groups of type B and D. The type B analogues ((rst considered by Montenegro in a diierent guise) turn out to be as well-behaved as the original non-crossing set partitions, and the type D analogues almost as well-behaved. In both cases, they are EL-labellable ranked lattices with symmetric chain dec...
متن کاملBijective Proofs of Certain Vector Partition Identities
for 1 <; i < k. L. Carlitz [2] first derived the generating function for restricted bipartite partitions. Subsequently Carlitz and Roselle [3] enumerated certain special families of these partitions e.g., restricted bipartite partitions where the m< and % are all odd. Finally both Roselle [4] and Andrews [1] have obtained different generalizations for multipartite partitions. All these results ...
متن کاملEnumeration of 1- and 2-crossing Partitions with Refinements
An enumeration of the 1-crossing partitions of [n] into k blocks by bijection with ordered trees with n edges, k internal nodes, and root degree j = 4 is presented. A semi-bijection of these ordered trees to Dyck paths of semilength n, k peaks, and j = 4 last peak height is used to derive a conjectured formula for the number of 1-crossing partitions of [n] with k blocks. We also explore some na...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 66 شماره
صفحات -
تاریخ انتشار 2016